Collections of Subsets with the Sperner Property

نویسندگان

  • JERROLD R. GRIGGS
  • J. R. GRIGGS
چکیده

Let X = {1,. . ., n) and Í" = {1,..., k), k < n. Let C(n, k) be the subsets of X which intersect Y, ordered by inclusion. Lih showed that C(n, k) has the Sperner property. Here it is shown that C(n, k) has several stronger properties. A nested chain decomposition is constructed for C(n, k) by bracketing. C(n, k) is shown to have the LYM property. A more general class of collections of subsets is studied: Let X be partitioned into parts Xx,. . ., Xm, let Ix, . . . , Im be subsets of {0, 1.«}, and let P {Z c X\ \Z n X¡\ e /„ 1 < i < m). Sufficient conditions on the /, are given for P to be LYM, or at least Sperner, and examples are provided in which P is not Sperner. Other results related to Spemer's theorem, the Kruskal-Katona theorem, and the LYM inequality are presented. In 1928 Sperner [18] showed that if S is a collection of subsets of X = {1,.. ., h) such that no set in S contains any other, then This bound is best-possible and is attained if and only if S consists of all subsets of A of size I \n I or all subsets of size \\n\. ([aj and [a] are, respectively, the greatest integer < a and the least integer > a.) Lih [15] recently discovered this generalization of Sperner's theorem: With A as above, let y be a fc-element subset of A, say Y = {I, . . ., k}. Again let 'S be a collection of subsets of A with no set in S containing any other, but with the additional property that each set in S has a nonempty intersection with Y. Then Equality is attained here for example if S consists of all subsets of A of size i^nl which intersect Y. Let C(n, k) denote the collection of all subsets of A which intersect Y, ordered by inclusion. Lih's result is that C(n, k) has the Sperner property. Following a review of the terminology of extremal set theory in §1, we show in §2 that C(n, k) has a stronger property: It is a nested chain order. In §3 we show that C(n, k) has the LYM property, which is also stronger than the Sperner property. We broaden this by looking at collections of all subsets of A with specified intersection sizes with each part of a partition of A. Specifically, Received by the editors August 25, 1980 and, in revised form, January 20, 1981. 1980 Mathematics Subject Classification Primary 05A05; Secondary 06A10. © 1982 American Mathematical Society 0002-9947/82/0000-0775/$05.2S 575 License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Part Set Systems

The two part Sperner theorem of Katona and Kleitman states that if X is an n-element set with partition X1 ∪X2, and F is a family of subsets of X such that no two sets A,B ∈ F satisfy A ⊂ B (or B ⊂ A) and A ∩ Xi = B ∩ Xi for some i, then |F| ≤ ( n ⌊n/2⌋ ) . We consider variations of this problem by replacing the Sperner property with the intersection property and considering families that satis...

متن کامل

On Lih's Conjecture concerning Spernerity

LetF be a nonempty collection of subsets of [n] = {1, 2, . . . , n}, each having cardinality t . Denote by PF the poset consisting of all subsets of [n] which contain at least one member of F , ordered by set-theoretic inclusion. In 1980, K. W. Lih conjectured that PF has the Sperner property for all 1 ≤ t ≤ n and every choice of F . This conjecture is known to be true for t = 1 but false, in g...

متن کامل

Subsets of Posets Minimising the Number of Chains

A well-known theorem of Sperner describes the largest collections of subsets of an nelement set none of which contains another set from the collection. Generalising this result, Erdős characterised the largest families of subsets of an n-element set that do not contain a chain of sets A1 ⊂ . . . ⊂ Ak of an arbitrary length k. The extremal families contain all subsets whose cardinalities belong ...

متن کامل

Another 3-Part Sperner Theorem

In this paper, we prove a higher order Sperner theorem.These theorems are stated after some notation and background results are introduced. For i, j positive integers with i ≤ j, let [i, j] denote the set {i, i + 1, . . . , j}. For k, n positive integers, set ( [n] k ) = {A ⊆ [1, n] : |A| = k}. A system A of subsets of [1, n] is said to be k-set system if A ⊆ ( [n] k ) . Two subsets A, B are in...

متن کامل

On a Covering Property of Maximal

In the lattice of subsets of an n-set X , every maximal Sperner family S may be partitioned into disjoint subfamilies A and B, such that the union of the upset of A with the downset of B yields the entire lattice: U(A) [ D(B) = 2 X . The result generalizes to certain posets.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010